Search for: All records

Rydberg atom arrays with Van der Waals interactions provide a controllable path to simulate the locally connected transverse-field Ising model (TFIM), a prototypical model in statistical mechanics. Remotely operating the publicly accessible Aquila Rydberg atom array, we experimentally investigate the physics of TFIM far from equilibrium and uncover significant deviations from the theoretical predictions. Rather than the expected ballistic spread of correlations, the Rydberg simulator exhibits a sub-ballistic spread, along with a logarithmic scaling of entanglement entropy in time - all while the system mostly retains its initial magnetization. By modeling the atom motion in tweezer traps, we trace these effects to an emergent natural disorder in Rydberg atom arrays, which we characterize with a minimal random spin model. We further experimentally explore the different dynamical regimes hosted in the system by varying the lattice spacing and the Rabi frequency. Our findings highlight the crucial role of atom motion in the many-body dynamics of Rydberg atom arrays at the TFIM limit, and propose simple benchmark measurements to test for its presence in future experiments. 

Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML). At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation. Canonically, a QP features input qubits and one output qubit, and is used to determine whether an input state belongs to a specific class. Rydberg atoms, with their extended coherence times and scalable spatial configurations, provide an ideal platform for implementing QPs. In this work, we explore the implementation of QPs on Rydberg atom arrays, assessing their performance in tasks such as phase classification between Z2, Z3, Z4 and disordered phases, achieving high accuracy, including in the presence of noise. We also perform multi-class entanglement classification by extending the QP model to include multiple output qubits, achieving 95\% accuracy in distinguishing noisy, high-fidelity states based on separability. Additionally, we discuss the experimental realization of QPs on Rydberg platforms using both single-species and dual-species arrays, and examine the error bounds associated with approximating continuous functions. 

Abstract Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) that capitalizes on inherent system dynamics. As a result, QNC can run on contemporary, noisy quantum hardware and is poised to realize challenging algorithms in the near term. One key issue in QNC is the characterization of the requisite dynamics for ensuring expressive quantum neuromorphic computation. We address this issue by proposing a building block for QNC architectures, what we call quantum perceptrons (QPs). Our proposed QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron that is the building block of various machine learning architectures. \framing{Moreover, we show that QPs are theoretically capable of producing any unitary operation.} Thus, QPs are computationally more expressive than their classical counterparts. As a result, QNC architectures built our of QPs are, theoretically, universal. We introduce a technique for mitigating barren plateaus in QPs called entanglement thinning. We demonstrate QPs' effectiveness by applying them to numerous QML problems, including calculating the inner products between quantum states, entanglement witnessing, and quantum metrology. Finally, we discuss potential implementations of QPs and how they can be used to build more complex QNC architectures. 

Quantum error correction (QEC) is believed to be essential for the realization of large-scale quantum computers. However, due to the complexity of operating on the encoded `logical' qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we utilize reconfigurable arrays of up to 448 neutral atoms to implement all key elements of a universal, fault-tolerant quantum processing architecture and experimentally explore their underlying working mechanisms. We first employ surface codes to study how repeated QEC suppresses errors, demonstrating 2.14(13)x below-threshold performance in a four-round characterization circuit by leveraging atom loss detection and machine learning decoding. We then investigate logical entanglement using transversal gates and lattice surgery, and extend it to universal logic through transversal teleportation with 3D [[15,1,3]] codes, enabling arbitrary-angle synthesis with logarithmic overhead. Finally, we develop mid-circuit qubit re-use, increasing experimental cycle rates by two orders of magnitude and enabling deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations with [[7,1,3]] and high-rate [[16,6,4]] codes while maintaining constant internal entropy. Our experiments reveal key principles for efficient architecture design, involving the interplay between quantum logic and entropy removal, judiciously using physical entanglement in logic gates and magic state generation, and leveraging teleportations for universality and physical qubit reset. These results establish foundations for scalable, universal error-corrected processing and its practical implementation with neutral atom systems. 

Quantum machine learning algorithms promise to deliver near-term, applicable quantum computation on noisy, intermediate-scale systems. While most of these algorithms leverage quantum circuits for generic applications, a recent set of proposals, called analog quantum machine learning (AQML) algorithms, breaks away from circuit-based abstractions and favors leveraging the natural dynamics of quantum systems for computation, promising to be noise-resilient and suited for specific applications such as quantum simulation. Recent AQML studies have called for determining best ansatz selection practices and whether AQML algorithms have trap-free landscapes based on theory from quantum optimal control (QOC). We address this call by systematically studying AQML landscapes on two models: those admitting black-boxed expressivity and those tailored to simulating a specific unitary evolution. Numerically, the first kind exhibits local traps in their landscapes, while the second kind is trap-free. However, both kinds violate QOC theory’s key assumptions for guaranteeing trap-free landscapes. We propose a methodology to co-design AQML algorithms for unitary evolution simulation using the ansatz’s Magnus expansion. Our methodology guarantees the algorithm has an amenable dynamical Lie algebra with independently tunable terms. We show favorable convergence in simulating dynamics with applications to metrology and quantum chemistry. We conclude that such co-design is necessary to ensure the applicability of AQML algorithms.